Constraint Satisfaction Techniques for Negotiating Agents
نویسندگان
چکیده
This paper discusses the deployment of constraint satisfaction methods as a way of enforcing the coordination of distinct and selfinterested agents in open and dynamic environments. We report back on our experience in deploying such approach for developing an agent based solution for resource allocation in multi-provider communication networks. This makes it possible to draw some conclusions on the main benefits and challenges for an effective integration of constraint satisfaction techniques in multi-agent sys-
منابع مشابه
Argumentation for Coordinating Shared Activities
There is an increasing need for space missions to be able to collaboratively (and competitively) develop plans both within and across missions. In addition, interacting spacecraft that interleave onboard planning and execution must reach consensus on their commitments to each other prior to execution. In domains where missions have varying degrees of interaction and different constraints on com...
متن کاملConstraint Satisfaction Techniques and Software Agents
Although constraint satisfaction techniques and agent technology have been combined in several ways, especially over the last few years, it is still debated how, beyond ad hoc approaches, these two computational paradigms can be effectively integrated. The aim of this paper is to analyze and discuss how constraint satisfaction techniques can be used to engineer agents’ reasoning and resolve coo...
متن کامل12th IEEE International Conference on Distributed Computing Systems '92, pp.614{621 Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملAgent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints can find a solution to a constraint satisfaction problem (CSP) when the individual agents have an incomplete view of the problem. In this paper we present a method of solving constraint satisfaction problems (CSPs) using cooperating constraint agents where each agent has a different representation of a particular CSP. Agents assist one another...
متن کاملDistributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002